Algorithms for finding a Kth best valued assignment
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Finding Best Viewpoints
We address the problem of nding viewpoints that preserve the relational structure of a three-dimensional graph drawing under or-thographic parallel projection. Previously, algorithms for nding the best viewpoints under two natural models of viewpoint \goodness" were proposed. Unfortunately, the inherent combinatorial complexity of the problem makes nding exact solutions is impractical. In this ...
متن کاملKth-Best Algorithm for Fuzzy Bilevel Programming
Organizational decision making often involves two decision levels. When the leader at the upper level attempts to optimize hislher objective, the follower at the lower level tries to find an optimized strategy according to each of possible decisions made by the leader. Furthermore, such bilevel decision making may involve uncertain parameters which appear either in the objective functions or co...
متن کاملReal-valued Frequency Assignment
We consider the binary constraints formulation of the frequency assignment problem in its most general form: for an arbitrary metric space, with frequencies taking arbitrary real values, and with possibly innnitely many constraints. We obtain some necessary and suucient conditions for the problem to have a solution with a nite span. When the metric space is the set of integers, we give an exact...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملOn the Average-Case Complexity of Selecting the kth Best
Let v,(n) be the minimum average number of pairwise comparisons needed to find the k-th largest of n numbers (k > 2) , assuming that all n! orderings are equally likely. D. W. Matula proved that, for sme absolute constant c , Vk(n)-n 5 c k log log n as n 3 = . In the -present-paper, we show that there exists an absolute constant c' > 0 such that v,(n)-n 2 c' k log log n as n 3 w , proving a con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)00175-l